Optimal penalty parameter forC0IPDG

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal penalty parameter for C0 IPDG

We derive the lower bound of the penalty parameter in the C IPDG for the bi-harmonic equation. Based on the bound, we propose a pre-processing algorithm. Numerical example are shown to support the theory. In addition, we found that an optimal penalty does exist.

متن کامل

Decrease of the Penalty Parameter in Differentiable Penalty Function Methods

We propose a simple modification to the differentiable penalty methods for solving nonlinear programming problems. This modification decreases the penalty parameter and the ill-conditioning of the penalty method and leads to a faster convergence to the optimal solution. We extend the modification to the augmented Lagrangian method and report some numerical results on several nonlinear programmi...

متن کامل

ADMM Penalty Parameter Selection by Residual Balancing

Appropriate selection of the penalty parameter is crucial to obtaining good performance from the Alternating Direction Method of Multipliers (ADMM). While analytic results for optimal selection of this parameter are very limited, there is a heuristic method that appears to be relatively successful in a number of different problems. The contribution of this paper is to demonstrate that their is ...

متن کامل

Adaptive ADMM with Spectral Penalty Parameter Selection

The alternating direction method of multipliers (ADMM) is a versatile tool for solving a wide range of constrained optimization problems, with differentiable or non-differentiable objective functions. Unfortunately, its performance is highly sensitive to a penalty parameter, which makes ADMM often unreliable and hard to automate for a non-expert user. We tackle this weakness of ADMM by proposin...

متن کامل

Minimization of multi-penalty functionals by alternating iterative thresholding and optimal parameter choices

Inspired by several recent developments in regularization theory, optimization, and signal processing, we present and analyze a numerical approach to multipenalty regularization in spaces of sparsely represented functions. The sparsity prior is motivated by the largely expected geometrical/structured features of high-dimensional data, which may not be well-represented in the framework of typica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 2014

ISSN: 0893-9659

DOI: 10.1016/j.aml.2014.06.001